Computing quantum discord is NP-complete
نویسنده
چکیده
We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete. Therefore, quantum discord is computationally intractable: the running time of any algorithm for computing quantum discord is believed to grow exponentially with the dimension of the Hilbert space so that computing quantum discord in a quantum system of moderate size is not possible in practice. As by-products, some entanglement measures (namely entanglement cost, entanglement of formation, relative entropy of entanglement, squashed entanglement, classical squashed entanglement, conditional entanglement of mutual information, and broadcast regularization of mutual information) and constrained Holevo capacity are NP-hard/NP-complete to compute. These complexity-theoretic results are directly applicable in common randomness distillation, quantum state merging, entanglement distillation, superdense coding, and quantum teleportation; they may offer significant insights into quantum information processing. Moreover, we prove the NP-completeness of two typical problems: linear optimization over classical states and detecting classical states in a convex set, providing evidence that working with classical states is generically computationally intractable.
منابع مشابه
Dynamics of entangled quantum optical system in independent media
We study the dynamics of two three-level atoms interacting with independent bosonic Lorentzian reservoirs at zero temperature. Such systems can be created in far astronomical objects. Quantum mechanical behaviour of these particles can produce detectable effects on the spectroscopic identifications of these objects, if such behaviour remain stable during the interaction with their media. It is ...
متن کاملQuantum discord and its allies: a review
We review concepts and methods associated with quantum discord and related topics. We also describe their possible connections with other aspects of quantum information and beyond, including quantum communication, quantum computation, many-body physics, and open quantum dynamics. Quantum discord in the multiparty regime and its applications are also discussed.
متن کاملCirculant States with Vanishing Quantum Discord
Quantum state of composite system contains both classical and quantum correlation. Usually by quantum correlations one means quantum entanglement which provides an essential resource for quantum information processing such as quantum cryptography, dense coding, quantum computing [1, 2]. However, a quantum state of a composed system may contain other types of nonclassical correlation even if it ...
متن کاملNP-complete Problems and Physical Reality
Can NP-complete problems be solved efficiently in the physical universe? I survey proposals including soap bubbles, protein folding, quantum computing, quantum advice, quantum adiabatic algorithms, quantum-mechanical nonlinearities, hidden variables, relativistic time dilation, analog computing, Malament-Hogarth spacetimes, quantum gravity, closed timelike curves, and “anthropic computing.” The...
متن کاملQuantum discord in quantum computation
Quantum discord is a measure of the quantumness of correlations. After reviewing its different versions and properties, we apply it to the questions of quantum information processing. First we show that changes in discord in the processed unentangled states indicate the need for entanglement in the distributed implementation of quantum gates. On the other hand, it was shown that zero system-env...
متن کامل